What’s the Magic Word?
نویسندگان
چکیده
Academic studies on the impact of taboo words on cognition, memory, perception, etc. support the intuitive position that taboo words are at least in part used because they are an effective tool in making meaning understood. What hasn’t been done, to the best of our knowledge, is to look at the effect of taboo words on speech recognition. To this end we have collected data comparing the impact of the word ‘fucking’ with the similarly used ‘goddamn’ and also with polite/plain forms of expression. Here we present the results of the study.
منابع مشابه
$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملA Contemplation in Shari'a's View towards the Magic with an Approach to Mawlana's Thoughts
The magic is something with a subtle source, which is not seen with eye, and its source cannot be found in a normal way. The magic has a variety of forms that have harmful and non-harmful effects. The wizards use the latter one to deceive people. The motive for choosing this topic among other ones is that some people resort to the magic for different reasons such as: outbreaking demons for the ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملObtaining relations between the Magic Formula coefficients and tire physical properties
This paper introduces a technique that relates the coefficients of the Magic Formula tire model to the physical properties of the tire. For this purpose, the tire model is developed by ABAQUS commercial software. The output of this model for the lateral tire force is validated by available tire information and then used to identify the tire force properties. The Magic Formula coefficients are o...
متن کامل